Achieving fair share objectives via goal - oriented parallel computer job scheduling policies
نویسنده
چکیده
supported on many production systems. However, fair share has been shown to cause performance problems for some users, especially the users with difficult jobs. This work is focusing on extending goal-oriented parallel computer job scheduling policies to cover the fair share objective. Goal-oriented parallel computer job scheduling policies have been shown to achieve good scheduling performances when conflicting objectives are required. Goal-oriented policies achieve such good performance by using anytime combinatorial search techniques to find a good compromised schedule within a time limit. The experimental results show that the proposed goal-oriented parallel computer job scheduling policy (namely Tradeoff-fs(Tw:avgX)) achieves good scheduling performances and also provides good fair share performance. Keywords— goal-oriented parallel job scheduling policies, fair share.
منابع مشابه
Evaluating per-user Fairness of Goal-Oriented Parallel Computer Job Scheduling Policies
Fair share objective has been included into the goaloriented parallel computer job scheduling policy recently. However, the previous work only presented the overall scheduling performance. Thus, the per-user performance of the policy is still lacking. In this work, the details of per-user fair share performance under the Tradeoff-fs(Tx:avgX) policy will be further evaluated. A basic fair share ...
متن کاملImpact of Fair Share and its Configurations on Parallel Job Scheduling Algorithms
To provide a better understanding of fair share policies supported by current production schedulers and their impact on scheduling performance, A relative fair share policy supported in four well-known production job schedulers is evaluated in this study. The experimental results show that fair share indeed reduces heavy-demand users from dominating the system resources. However, the detailed p...
متن کاملOn Job Fairness in Non-Preemptive Parallel Job Scheduling
Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill polic...
متن کاملUnfairness Metrics for Space-Sharing Parallel Job Schedulers
Sociology, computer networking and operations research provide evidence of the importance of fairness in queuing disciplines. Currently, there is no accepted model for characterizing fairness in parallel job scheduling. We introduce two fairness metrics intended for parallel job schedulers, both of which are based on models from sociology, networking, and operations research. The first metric i...
متن کاملA Framework for a Multiagent-based Scheduling of Parallel Jobs
This paper presents a multiagent approach as a paradigm for scheduling parallel jobs in a parallel system. Scheduling parallel jobs is performed as a means to balance the load of a system in order to improve the performance of a parallel application. Parallel job scheduling is presented as a mapping between two graphs: one represents the dependency of jobs and the other represents the interconn...
متن کامل